Stability Improvement of Hydraulic Turbine Regulating System Using Round-Robin Scheduling Algorithm

نویسندگان

  • Fariba Heidarpour Smart Microgrid Research Center, Najafabad Branch, Islamic Azad University, Najafabad, Iran.
  • Ghazanfar shahgholian Department of Electrical Engineering, Najafabad Branch, Islamic Azad University, Najafabad, Iran
چکیده مقاله:

The sustainability of hydraulic turbines was one of the most important issues considered by electrical energy provider experts. Increased electromechanical oscillation damping is one of the key issues in the turbines sustainability. Electromechanical oscillations, if not quickly damp, can threaten the stability of hydraulic turbines and causes the separation of different parts of the network form each other, specifically ejecting the generators from the turbine. In this paper, a Round-robin scheduling algorithm was used based on a neural network and simulations were investigated by several methods. Thus, using the designed Round-robin scheduling algorithm, we can find three parameters simultan­eously. So optimal outputs can determine by these three parameters, which would be investigated as the optimal output range. In other words, besides using other algorithms capability, it can eliminate some of their disadvantages. The Round-robin scheduling algorithm is more suitable for large and extensive systems, due to reducing the number input variables and have a non-linear and resistant structure at the same time, This algorithm can actually use for optimizing any other controlling methods. 

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evaluation of Surplus Round Robin Scheduling Algorithm

In multi-service packet networks the packet scheduling algorithm plays a key role in delivering guaranteed service to different flows. In this article we evaluate surplus round robin (SRR) scheduling algorithm. We apply the Latency-Rate (LR) servers theory in order to obtain bounds on the latency and delay provided by the algorithm. We compare the performance characteristics of SRR with the pop...

متن کامل

Optimal Round Robin CPU Scheduling Algorithm using Manhattan Distance

Received Mar 23, 2017 Revised Sep 8, 2017 Accepted Sep 25, 2017 In Round Robin Scheduling the time quantum is fixed and then processes are scheduled such that no process get CPU time more than one time quantum in one go. The performance of Round robin CPU scheduling algorithm is entirely dependent on the time quantum selected. If time quantum is too large, the response time of the processes is ...

متن کامل

Modified Round Robin Scheduling Algorithm Using Variable Time Slice

CPU scheduling is the basis of multi-programmed operating systems. The main objective of scheduling algorithms is to reduce the response time, waiting time and to increase the throughput and CPU utilization. Round Robin assumes that all processes are equally important; each receives an equal portion (time slice) of the CPU. This will sometimes affect the performance of CPU. This paper considers...

متن کامل

Achieving Stability in the Round Robin Algorithm

The Round Robin algorithm is a CPU scheduling algorithm that is designed especially for time sharing systems. Each process is assigned a slice of time called time quantum to execute. To increase the performance of a Round Robin algorithm, it is important to choose an optimal time quantum. Many algorithms developed the Round Robin algorithm. This paper provides an algorithm that improves the per...

متن کامل

An Optimized Round Robin Scheduling Algorithm for CPU Scheduling

The main objective of this paper is to develop a new approach for round robin scheduling which help to improve the CPU efficiency in real time and time sharing operating system. There are many algorithms available for CPU scheduling. But we cannot implemented in real time operating system because of high context switch rates, large waiting time, large response time, large trn around time and le...

متن کامل

Simulation of an Optimum Multilevel Dynamic Round Robin Scheduling Algorithm

CPU scheduling has valiant effect on resource utilization as well as overall quality of the system. Round Robin algorithm performs optimally in timeshared systems, but it performs more number of context switches, larger waiting time and larger response time. The devised tool “OMDRRS” was utilized to simulate the four algorithms (FCFS, SJF, ROUND ROBIN & Proposed Dynamic Round Robin Algorithm) u...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 5  شماره 1

صفحات  1- 7

تاریخ انتشار 2018-01-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023